A Reliable Sorting Algorithm on Hypercube Multicomputers
نویسندگان
چکیده
In this paper, we present an algorithm-based fault-tolerant technique, namely the median-splitting strategy, for designing a reliable sorting algorithm. Combining the median-splitting strategy with bitonic sorting algorithm, a reliable sorting algorithm is proposed on the hypercube multicomputers. By the strategies of duplicating data and rollback, the proposed algorithm can detect transient faults and automatically correct errors without any hardware modi cation. We also implement our algorithm on NCUBE/7 MIMD hypercube machines with 64 processors. The simulation results show that our sorting algorithm is reliable and cost-e ective.
منابع مشابه
Algorithm - Based Fault - Tolerant Strategies in FaultyHypercube and Star
This dissertation addresses the design of algorithm-based fault-tolerant strategies in faulty hypercube and star graph multicomputers without hardware modi cation. Several new concepts and designs are presented here under the permanent and transient fault models. Under the permanent fault model, we propose a new fault-tolerant recon guration scheme in the faulty hypercube and star graph multico...
متن کاملExecuting Algorithms with Hypercube Topology on Torus Multicomputers
Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...
متن کاملFault - Tolerant Sorting Algorithm on
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that can tolerate up n 1 faulty processors. First, we indicate that the bitonic sorting algorithm can perform sorting operations correctly on the hypercubes with one faulty processor. In order to tolerate up r n 1 fau...
متن کاملFault-Tolerant Sorting Algorithm on Hypercube Multicomputers
In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-dimensional hypercube multi-computers. We propose a fault-tolerant sorting algorithm that can tolerate up to n-1 faulty processors. Fit, we indicate that the bitouic sorting algorithm cau perform sorting operations correctly on hypercubes with one faulty processor. In order to tolerate up to rsn-1 fa...
متن کاملEmbedding Hypercubes onto Rings and Toruses
Many parallel algorithms use hypercubes as the communication topology among processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Algorithms Appl.
دوره 5 شماره
صفحات -
تاریخ انتشار 1995